منابع مشابه
Parallel Opposite Sides Polygons
In this paper we consider planar polygons with parallel opposite sides. This type of polygons can be regarded as discretizations of closed convex planar curves by taking tangent lines at samples with pairwise parallel tangents. For this class of polygons, we define discrete versions of the area evolute, central symmetry set, equidistants and area parallels and show that they behave quite simila...
متن کاملCyclic polygons with rational sides and area
We generalise the notion of Heron triangles to rational-sided, cyclic n-gons with rational area using Brahmagupta’s formula for the area of a cyclic quadrilateral and Robbins’ formulæ for the area of cyclic pentagons and hexagons. We use approximate techniques to explore rational area n-gons for n greater than six. Finally, we produce a method of generating non-Eulerian rational area cyclic n-g...
متن کاملOn the Relative Lengths of Sides of Convex Polygons
Let C be a convex body. By the relative distance of points p and q we mean the ratio of the Euclidean distance of p and q to the half of the Euclidean length of a longest chord of C parallel to pq. The aim of the paper is to find upper bounds for the minimum of the relative lengths of the sides of convex hexagons and
متن کاملConnectedness of Opposite-flag Geometries in Moufang Polygons
A generalized n-gon, n 2, is a rank 2 geometry whose incidence graph has diameter n and girth 2n, and each vertex has valency 3. If the latter condition is not satisfied , then we have a weak generalized n-gon. In this paper, we will always consider generalized n-gons with n 3 (generalized 2-gons are trivial geometries). They are the irreducible spherical buildings of rank 2. A generalized poly...
متن کاملA Multipole Method for Schwarz-Christoffel Mapping of Polygons with Thousands of Sides
A method is presented for the computation of Schwarz–Christoffel maps to polygons with tens of thousands of vertices. Previously published algorithms have CPU time estimates of the order O(N3) for the computation of a conformal map of a polygon with N vertices. This has been reduced to O(N logN) by the use of the fast multipole method and Davis’s method for solving the parameter problem. The me...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2013
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-013-9520-2